Odd K3, 3 subdivisions in bipartite graphs
نویسندگان
چکیده
We prove that every internally 4-connected non-planar bipartite graph has an odd K3,3 subdivision; that is, a subgraph obtained from K3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to a polynomial-time algorithm to find such a subdivision. (A bipartite graph G is internally 4-connected if it is 3-connected, has at least five vertices, and there is no partition (A,B,C) of V (G) such that |A|, |B| ≥ 2, |C| = 3 and G has no edge with one end in A and the other in
منابع مشابه
Totally odd subdivisions and parity subdivisions: Structures and Coloring
A totally odd H-subdivision means a subdivision of a graph H in which each edge of H corresponds to a path of odd length. Thus this concept is a generalization of a subdivision of H. In this paper, we give a structure theorem for graphs without a fixed graph H as a totally odd subdivision. Namely, every graph with no totally odd H-subdivision has a tree-decomposition such that each piece is eit...
متن کاملMatching Covered Graphs and Subdivisions of K 4 and C 6 Matching Covered Graphs and Subdivisions of K 4 and C 6
We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph that is an odd subdivision of K 4 or C 6. It follows immediately that every brick diierent from K 4 and C 6 has an edge whose removal preserves the matching covered property. These are classical and very useful results due to Lovv asz.
متن کاملThe obstructions for toroidal graphs with no K3, 3's
We prove a precise characterization of toroidal graphs with no K3,3-subdivisions in terms of forbidden minors and subdivisions. The corresponding lists of four forbidden minors and eleven forbidden subdivisions are shown.
متن کاملForbidden minors and subdivisions for toroidal graphs with no K3, 3's
Forbidden minors and subdivisions for toroidal graphs are numerous. In contrast, the toroidal graphs with no K3,3’s have a nice explicit structure and short lists of obstructions. For these graphs, we provide the complete lists of four forbidden minors and eleven forbidden subdivisions.
متن کاملEven and odd pairs in linegraphs of bipartite graphs
Two vertices in a graph are called an even pair (odd pair) if all induced paths between these two vertices have even (odd) length. Even and odd pairs have turned out to be of importance in conjunction with perfect graphs. We will characterize all linegraphs of bipartite graphs that contain an even resp. odd pair. In general, it is a co-NP-complete problem to decide whether a graph contains an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 118 شماره
صفحات -
تاریخ انتشار 2016